An optimization technique on pseudorandom generators based on chaotic iterations

International audienceInternet communication systems involving cryptography and data hiding often require billions of random numbers. In addition to the speed of the algorithm, the quality of the pseudo-random number generator and the ease of its implementation are common practical aspects. In this work we will discuss how to improve the quality of random numbers independently from their generation algorithm. We propose an additional implementation technique in order to take advantage of some chaotic properties. The statistical quality of our solution stems from some well-defined discrete chaotic iterations that satisfy the reputed Devaney's definition of chaos, namely the chaotic iterations technique. Pursuing recent researches published in the previous International Conference on Evolving Internet (Internet 09, 10, and 11), three methods to build pseudorandom generators by using chaotic iterations are recalled. Using standard criteria named NIST and DieHARD (some famous batteries of tests), we will show that the proposed technique can improve the statistical properties of a large variety of defective pseudorandom generators, and that the issues raised by statistical tests decrease when the power of chaotic iterations increase

State-of-the-art in Chaotic Iterations based pseudorandom numbers generators Application in Information Hiding

International audienceThe confidentiality of information transmitted through the Internet requires an intensive use of pseudorandom number generators having strong security properties. For instance, these generators are used to produce encryption keys, to encrypt data with a one-time pad process, or to dissimulate information into cover media. In the previous International Conference on Evolving Internet (Internet 09, 10, and 11), we have proposed the use of discrete chaotic iterations to build pseudorandom number generators that receive two inputted possibly deficient generators, and mix them to produce pseudorandom numbers with high statistical qualities. In this article, we summarize these contributions and we propose simple applications of these generators for encryption and information hiding. For each application, firsts experimental evaluations are given, showing that an attacker using these statistics as detection tools cannot infer the presence of an hidden message into given cover documents

Suitability of chaotic iterations schemes using XORshift for security applications

International audienceThe design and engineering of original cryptographic solutions is a major concern to provide secure information systems. In a previous study, we have described a generator based on chaotic iterations, which uses the well-known XORshift generator. By doing so, we have improved the statistical performances of XORshift and make it behave chaotically, as defined by Devaney. The speed and security of this former generator have been improved in a second study, to make its usage more relevant in the Internet security context. In this paper, these contributions are summarized and a new version of the generator is introduced. It is based on a new Lookup Table implying a large improvement of speed. A comparison and a security analysis between the XORshift and these three versions of our generator are proposed, and various new statistical results are given. Finally, an application in the information hiding framework is presented, to give an illustrative example of the use of such a generator in the Internet security field

Noise and chaos contributions in fast random bit sequence generated from broadband optoelectronic entropy sources

International audienceDuring the last 4 years, chaotic waveforms for random number generation found a deep interest within the community of analogue broadband chaotic optical systems. Earlier investigations on chaos-based RNG were proposed in the 90s and early 2000, however mainly based on piecewise linear (PL) 1D map, with bit rate determined by analog electronic processing capabilities to provide the PL nonlinear function of concern. Optical chaos came with promises for much higher bit rate, and entropy sources based on high complexity (high dimensional) continuous time (differential) dynamics. More specifically in 2009, Reidler et al. published a paper entitled "An optical ultrafast random bit generator", in which they presented a physical system for a random number generator based on a chaotic semiconductor laser. This generator is claimed to reach potentially the extremely high rate of 300 Gb/s. We report on analysis and experiments of their method, which leads to the discussion about the actual origin of the obtained randomness. Through standard signal theory arguments, we show that the actual binary randomness quality obtained from this method, can be interpreted as a complex mixing operated on the initial analogue entropy source. Our analysis suggests an explaination about the already reported issue that this method does not necessarily require any specific deterministic property (i.e. chaos) from the physical signal used as the physical source of entropy. The bit stream randomness quality is found to result from "aliasing" phenomena performed by the post-processing method, both for the sampling and the quantization operations. As an illustration, such random bit sequences extracted from different entropy sources are investigated. Optoelectronic noise is used as a non deterministic entropy source. Electro-optic phase chaotic signal, as well as simulations of its deterministic model, are used as deterministic entropy sources. In all cases, the extracted bit sequence reveals excellent randomness

Study on a new chaotic bitwise dynamical system and its FPGA implementation

International audienceIn this paper, the structure of a new chaotic bitwise dynamical system (CBDS) is described. Compared to our previous research work, it uses various random bitwise operations instead of only one. The chaotic behavior of CBDS is mathematically proven according to the Devaney's definition, and its statistical properties are verified both for uniformity and by a comprehensive, reputed and stringent battery of tests called TestU01. Furthermore, a systematic methodology developing the parallel computations is proposed for FPGA platform-based realization of this CBDS. Experiments finally validate the proposed systematic methodology